One-sided Mutual Exclusion A new Approach to Mutual Exclusion Primitives
نویسنده
چکیده
Todays operating systems are designed to manage multiple processes within uniprocessor systems, within several processors and even within distributed computer systems. Fundamental to this design is concurrency, especially mutual exclusion of multiple processes. All mutual exclusion techniques so far are designed to bother all involved processes. The first part of this paper shows an overview of the most common existing techniques that solves this problem. A new approach with a completely different design technique will be discussed afterwards. It is not always necessary to involve all processes and still maintain mutual exclusion. A couple of implementations for different operating systems and user/kernel mode applications will be compared to existing techniques.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملTime Complexity Bounds for Shared-memory Mutual Exclusion
YONG-JIK KIM: Time Complexity Bounds for Shared-memory Mutual Exclusion. (Under the direction of James H. Anderson.) Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic” problems in concurrent programming. Recent work on scalable shared-memory mutual...
متن کاملLocal-spin Mutual Exclusion Using Fetch-and- Primitives
We present a generic fetch-and-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is \generic" in the sense that it can be implemented using any fetch-andprimitive of rank 2N , where N is the number of processes. The rank of a fetch-andprimitive is a notion introduced herein; informally, it expresses the extent ...
متن کاملEvaluating and designing software mutual exclusion algorithms on shared-memory multiprocessors
Spring 1996 hared-memory multiprocessor systems must provide facilities called critical sections for programs to share physical and logical resources. Only one processor at a time can process a CS. This requires a method to ensure mutually exclusive access to the logically atomic operations of a shared CS. Two approaches to mutual exclusion are hardware algorithms, which use primitives, and sof...
متن کاملLocal - spin Mutual Exclusion Using Fetch - and - φ Primitives ∗ ( Extended Abstract )
We present a generic fetch-and-φ-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is “generic” in the sense that it can be implemented using any fetch-and-φ primitive of rank 2N , where N is the number of processes. The rank of a fetch-and-φ primitive is a notion introduced herein; informally, it expresses the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004